Pruning Pareto optimal solutions for multi-objective portfolio asset management
نویسندگان
چکیده
Budget allocation problems in portfolio management are inherently multi-objective as they entail different types of assets which performance metrics not directly comparable. Existing asset methods that either consolidate multiple goals to form a single objective (a priori) or populate Pareto optimal set posteriori) may be sufficient because decision maker (DM) possess comprehensive knowledge the problem domain. Moreover, current techniques often present with too many options, making it counter-productive. In order provide DM diverse yet compact solution set, this paper proposes three-step approach. first step, we employ approximation functions capture investment-performance relationships at asset-type level. These simplified then used inputs for optimisation model second step. final solutions generated by selected evolutionary algorithm pruned clustering method. To measure spread representative over front, two novel indicators based on average Euclidean distance and cosine similarity between original solutions. Through numerical examples, demonstrate approach can maintain high integrity front. We also put forward suggestions choosing appropriate functions, pruning methods, indicators.
منابع مشابه
Pareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملApproximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملMulti-Objective Evolutionary Algorithms: Introducing Bias Among Pareto-Optimal Solutions
Since the beginning of Nineties, research and application of multi-objective evolutionary algorithms (MOEAs) have found increasing attention. This is mainly due to the ability of evolutionary algorithms to find multiple Pareto-optimal solutions in one single simulation run. In this paper, we present an overview of the multi-objective evolutionary algorithms and then discuss a particular algorit...
متن کاملPareto-optimal solutions in fuzzy multi-objective linear programming
The problem of solving multi-objective linear-programming problems, by assuming that the decision maker has fuzzy goals for each of the objective functions, is addressed. Several methods have been proposed in the literature in order to obtain fuzzyefficient solutions to fuzzy multi-objective programming problems. In this paper we show that, in the case that one of our goals is fully achieved, a...
متن کاملapproximate pareto optimal solutions of multi-objective optimal control problems by evolutionary algorithms
in this paper an approach based on evolutionary algorithms to find pareto optimal pair of state and control for multi-objective optimal control problems (moocp)'s is introduced. in this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2022
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2021.04.053